Simulating the Paninian System of Sanskrit Grammar

نویسنده

  • Anand Mishra
چکیده

We propose a model for the computer representation of the Pān. inian system of sanskrit grammar. Based on this model, we render the grammatical data and simulate the rules of As.t.ādhyāȳı on computer. We then employ these rules for generation of morpho-syntactical components of the language. These generated components we store in a psubsequential automata. This we use to develop a lexicon on Pān. inian principles. We report briefly its implementation. 1 A Representation of As.t.ādhyāȳı The general grammatical process of As.t.ādhyāȳı (Katre, 1989) can be viewed as consisting of the following three basic steps: 1. Prescription of the fundamental components which constitute the language. 2. Characterization of these fundamental components by assigning them a number of attributes. 3. Specification of grammatical operations based on the fundamental components and their attributes. 1.1 Fundamental Components In his grammar Pān. ini furnishes a number of elements (phonemes/morphemes/lexemes) which constitute the building blocks of the language. We assign each of them a unique key in our database. Thus the phoneme /a/ has the key a 0, the kr. t suffix /a/ has the key a 3 and the taddhita suffix /a/ is represented by the key a 4. Given such a collection of unique keys, we define the set of fundamental components as follows: Definition 1 The collection of unique keys corresponding to the basic constituents of the language, we define as the set F of fundamental components. Further, we decompose this set F into two disjoint sets P and M, where P is the set of keys corresponding to the phonemes and M containing the keys of the rest of the constituting elements (morphemes/lexemes). P = {a 0, i 0, u 0, . . .} M = {bhU a, tip 0, laT 0, . . .} F = P ∪M (1) P ∩M = φ (2) 1.2 Attributes The fundamental units of the language are given an identity by assigning a number of attributes to them. The various technical terms introduced in the grammar come under this category, as also the it -markers and sigla or pratyāhāras. For example, the attributes hrasva, gun. a and ac characterize the element a 0 as short vowel /a/ and attributes like pratyaya, prathama and ekavacana tell that tip (= tip 0) is a third-person singular suffix. Again, each attribute is assigned a unique key in our database. Definition 2 The collection of unique keys corresponding to the terms, which characterize a fundamental component, we define as the set A of attributes. Corresponding to the sets P and M we can decompose the set A into two disjoint sets Aπ and Aμ, Aπ being the set of unique keys of the attributes to the elements of P and Aμ to elements of M. Aπ = {hrasva 0, udAtta 0, it 0, . . .} Aμ = {dhAtu 0, pratyaya 0, zit 9, . . .}

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling the Grammatical Circle of the Paninian System of Sanskrit Grammar

In the present article we briefly sketch an extended version of our previously developed model for computer representation of the Pān. inian system of Sanskrit grammar. We attempt to implement an antecedent analytical phase using heuristical methods and improve the subsequent phase of reconstitution using the rules of As.t .ādhyāȳı by incorporating strategies for automatic application of gramma...

متن کامل

Annotation and Issues in Building an English Dependency Treebank

The Paninian Grammar framework, given by Panini for his analysis of Sanskrit Language, is finding its extensive application on languages other than Sanskrit, about two thousand five hundred years after its formulation. The work presented in this paper is one such application that extends Paninian Grammar (PG or CPG: Computational Paninian Grammar) to English, a fixed word order language. It pre...

متن کامل

Computational Algorithms Based on the Paninian System to Process Euphonic Conjunctions for Word Searches

Searching for words in Sanskrit E-text is a problem that is accompanied by complexities introduced by features of Sanskrit such as euphonic conjunctions or ‘sandhis’. A word could occur in an E-text in a transformed form owing to the operation of rules of sandhi. Simple word search would not yield these transformed forms of the word. Further, there is no search engine in the literature that can...

متن کامل

Completeness Analysis of a Sanskrit Reader

We analyse in this paper differences of linguistic treatment of Sanskrit in the Sanskrit Heritage platform and in the Paninian gram-

متن کامل

Handling of Infinitives in English to Sanskrit Machine Translation

The development of Machine Translation (MT) system for ancient language like Sanskrit is a fascinating and challenging task. In this paper, the authors handle the infinitive type of English sentences in the English to Sanskrit machine translation (EST) system. The EST system is an integrated model of a rule-based approach of machine translation with Artificial Neural Network (ANN) model that tr...

متن کامل

Book Reviews: Natural Language Processing: A Paninian Perspective

This book is an elementary introduction to natural language processing, but it is a very unusual one for two reasons. First, its subject languages are those of India; second, although the book sets out and discusses the better-known linguistic grammars that are commonly used in natural language processing, the grammar that the book actually uses is one based on the Astfidhy~y~ (pronotmced 'asht...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008